Global Hybrid Routing for Scale-Free Networks
نویسندگان
چکیده
منابع مشابه
Integrating Local and Global Routing on Scale-free Networks
Network navigation is one of the main problems in large communication networks. We propose a new routing strategy in which some smart nodes in networks deliver messages to next hops on the paths towards destinations according to Yan's algorithm while the other nodes just deliver messages randomly. We test our routing strategy in a large scale-free network. Simulations show that the average deli...
متن کاملa hybrid routing method for mobile ad-hoc networks
mobile-ad-hoc-networks (manets) are self-configuring networks of mobile nodes, which communicate through wireless links. the infrastructure of a mobile ad hoc network (manet) has no routers for routing, and all nodes must share the same routing protocol to assist each other when transmitting messages. the main issues in manets include the mobility of the network nodes, the scarcity of computati...
متن کاملImproved routing strategies for data traffic in scale-free networks
We study the information packet routing process in scale-free networks by mimicking Internet traffic delivery. We incorporate both the global shortest paths information and local degree information of the network in the dynamic process, via two tunable parameters, α and β, to guide the packet routing. We measure the performance of the routing method by both the average transit times of packets ...
متن کاملTraffic Properties for Stochastic Routing on Scale-Free Networks
For realistic scale-free networks, we investigate the traffic properties of stochastic routing inspired by a zero-range process known in statistical physics. By parameters α and δ, this model controls degree-dependent hopping of packets and forwarding of packets with higher performance at more busy nodes. Through a theoretical analysis and numerical simulations, we derive the condition for the ...
متن کاملEfficient and robust routing on scale-free networks
Information routing is one of the most important problems in large communication networks. In this paper we propose a novel routing strategy in which the optimal paths between all pairs of nodes are chosen according to a cost function that incorporates degrees of nodes in paths. Results on large scale-free networks demonstrate that our routing strategy ismore efficient than the shortest path al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2897255